Nearest neighbor embedding with different time delays
نویسندگان
چکیده
منابع مشابه
Discriminant Projections Embedding for Nearest Neighbor Classification
In this paper we introduce a new embedding technique to linearly project labeled data samples into a new space where the performance of a Nearest Neighbor classifier is improved. The approach is based on considering a large set of simple discriminant projections and finding the subset with higher classification performance. In order to implement the feature selection process we propose the use ...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملAn algorithm for `1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on `2 distance. Here we develop an approach for `1 distance that begins with an explicit and exactly distance-preserving embedding of the points into `2. We show how this can efficiently be combined with random-projection based methods for `2 NN search, such as locality-sensitive hashing (LSH) or random projection trees...
متن کاملAn algorithm for L1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on 2 distance. Here we develop an approach for 1 distance that begins with an explicit and exactly distance-preserving embedding of the points into 2. We show how this can efficiently be combined with random-projection based methods for 2 NN search, such as locality-sensitive hashing (LSH) or random projection trees. We...
متن کاملTrading Quality for Time with Nearest Neighbor Search
In many situations, users would readily accept an approximate query result if evaluation of the query becomes faster. In particular, this holds true for Nearest-Neighbor Search (NN-Search), a typical implementation of similarity search. In this article, we investigate approximate NNquery evaluation techniques based on the VA-File. This data structure efficiently supports NNquery evaluation in h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.71.037204